منابع مشابه
Counting Preimages
For noninvertible maps, mainly subshifts of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, random in the sense that at each step every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way. It tuns out that instead of the topological entropy we get the metric ...
متن کاملCounting preimages of TCP reordering patterns
Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial problem motivated by RESTORED [1], a TCP modeling methodology that incorporates information about packet dynamics. A significant component of this model is a many-to-one mapping B that transforms sequences of packet IDs i...
متن کاملCounting Preimages of Homogeneous Configurations in 1-Dimensional Cellular Automata
A cellular automaton (CA) is in a homogeneous configuration if every cell has the same state. The preimages of a configuration s are those configurations which evolve to s within a single time step. We present two methods of finding the total number of preimages for a given homogeneous configuration. The first is more intuitive, and gives a clear picture of how the number of preimages varies wi...
متن کاملPractical Preimages for Maraca
The cryptographic hash function Maraca was submitted to the NIST SHA-3 competition [4] by Jenkins [3]. In this work, we show a practical preimage attack on Maraca. Our attack has been implemented and verified experimentally. This shows that Maraca does not achieve several important security properties which a secure cryptographic hash function is expected to offer.
متن کاملPreimages of Small Geometric Cycles
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A geometric graph G is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position A geometric homomorphism (resp. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2017
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2016.103